Ergodic Theory over F
نویسندگان
چکیده
In cryptography and coding theory, it is important to study the pseudo-random sequences and the ergodic transformations. We already have the 1-Lipshitz ergodic theory over Z2 established by V. Anashin and others. In this paper we present an ergodic theory over F2[[T ]] and some ideas which might be very useful in applications.
منابع مشابه
Uniform Ergodic Theorems for Dynamical Systems Under VC Entropy Conditions
The classic limit theorems of Vapnik and Chervonenkis [27,28] show that if a function class F satisfies a random entropy condition, then the strong law of large numbers holds uniformly over F . In this paper we show that an analogous weighted entropy condition implies that Birkhoff’s pointwise ergodic theorem holds uniformly over F . In this way we obtain a variety of uniform ergodic theorems f...
متن کاملErgodicity of Diffusion and Temporal Uniformity of Diffusion Approximation
Let {XN(t), t0}, N = 1,2,be a sequence of continuous-parameter Markov processes, and let T,(t)f(x)= EX[f(X,(t))]. Suppose that lim,NcT^(t)f(x)= T(t)f(x), and that convergence is uniform over x and over t E [0, K] for all K < o. When is convergence uniform over t E [0, oo)? Questions of this type are considered under the auxiliary condition that T(t)f(x) converges uniformly over x as t -> oo. A ...
متن کاملIndividual ergodic theorem for intuitionistic fuzzy observables using intuitionistic fuzzy state
The classical ergodic theory hasbeen built on σ-algebras. Later the Individual ergodictheorem was studied on more general structures like MV-algebrasand quantum structures. The aim of this paper is to formulate theIndividual ergodic theorem for intuitionistic fuzzy observablesusing m-almost everywhere convergence, where m...
متن کاملKorovkin tests, approximation, and ergodic theory
We consider sequences of s · k(n)× t · k(n) matrices {An(f)} with a block structure spectrally distributed as an L1 p-variate s× t matrix-valued function f , and, for any n, we suppose that An(·) is a linear and positive operator. For every fixed n we approximate the matrix An(f) in a suitable linear space Mn of s · k(n) × t · k(n) matrices by minimizing the Frobenius norm of An(f)−Xn when Xn r...
متن کاملThe Ergodic Theorem
Measure-preserving systems arise in a variety of contexts, such as probability theory, information theory, and of course in the study of dynamical systems. However, ergodic theory originated from statistical mechanics. In this setting, T represents the evolution of the system through time. Given a measurable function f : X → R, the series of values f(x), f(Tx), f(T x)... are the values of a phy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011